1-optimality of static BSP computations: scheduling independent chains as a case study (2003)
Goldman, Alfredo 
; Mounie, Gregory; Trystram, Denis
Source: Theoretical Computer Scence. Unidade: IME
Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GOLDMAN, Alfredo e MOUNIE, Gregory e TRYSTRAM, Denis. 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Scence, v. 290, n. 3, p. 1331-1359, 2003Tradução . . Disponível em: https://doi.org/10.1016/S0304-3975(02)00039-7. Acesso em: 30 abr. 2024.APA
Goldman, A., Mounie, G., & Trystram, D. (2003). 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Scence, 290( 3), 1331-1359. doi:10.1016/S0304-3975(02)00039-7NLM
Goldman A, Mounie G, Trystram D. 1-optimality of static BSP computations: scheduling independent chains as a case study [Internet]. Theoretical Computer Scence. 2003 ; 290( 3): 1331-1359.[citado 2024 abr. 30 ] Available from: https://doi.org/10.1016/S0304-3975(02)00039-7Vancouver
Goldman A, Mounie G, Trystram D. 1-optimality of static BSP computations: scheduling independent chains as a case study [Internet]. Theoretical Computer Scence. 2003 ; 290( 3): 1331-1359.[citado 2024 abr. 30 ] Available from: https://doi.org/10.1016/S0304-3975(02)00039-7
